Markov Chain Monte Carlo Methods for Lattice Gaussian Sampling: Convergence Analysis and Enhancement
نویسندگان
چکیده
منابع مشابه
Lattice Gaussian Sampling by Markov Chain Monte Carlo: Convergence Rate and Decoding Complexity
Sampling from the lattice Gaussian distribution is an efficient way for solving the closest vector problem (CVP) in lattice decoding. In this paper, decoding by MCMC-based lattice Gaussian sampling is investigated in full details. First of all, the spectral gap of the transition matrix of the Markov chain induced by the independent Metropolis-Hastings-Klein (MHK) algorithm is derived, dictating...
متن کاملMarkov Chain Monte Carlo and Gibbs Sampling
A major limitation towards more widespread implementation of Bayesian approaches is that obtaining the posterior distribution often requires the integration of high-dimensional functions. This can be computationally very difficult, but several approaches short of direct integration have been proposed (reviewed by Smith 1991, Evans and Swartz 1995, Tanner 1996). We focus here on Markov Chain Mon...
متن کاملMarkov Chain Monte Carlo and Gibbs Sampling
A major limitation towards more widespread implementation of Bayesian approaches is that obtaining the posterior distribution often requires the integration of high-dimensional functions. This can be computationally very difficult, but several approaches short of direct integration have been proposed (reviewed by Smith 1991, Evans and Swartz 1995, Tanner 1996). We focus here on Markov Chain Mon...
متن کاملRepresentative Subgraph Sampling using Markov Chain Monte Carlo Methods
Bioinformatics and the Internet keep generating graph data with thousands of nodes. Most traditional graph algorithms for data analysis are too slow for analysing these large graphs. One way to work around this problem is to sample a smaller ‘representative subgraph’ from the original large graph. Existing representative subgraph sampling algorithms either randomly select sets of nodes or edges...
متن کاملMinorization Conditions and Convergence Rates for Markov Chain Monte Carlo
We provide general methods for analyzing the convergence of discrete-time, general state space Markov chains, such as those used in stochastic simulation algorithms including the Gibbs sampler. The methods provide rigorous, a priori bounds on how long these simulations should be run to give satisfactory results. We apply our results to two models of the Gibbs sampler, the rst a bivariate normal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2019
ISSN: 0090-6778,1558-0857
DOI: 10.1109/tcomm.2019.2926470